Binary Cyclic Codes and Minimal Codewords
نویسنده
چکیده
Cyclic codes form an important class of codes. They have very interesting algebraic structure. Furthermore, they are equivalent to many important codes, such as binary Hamming codes, Golay codes and BCH codes. Minimal codewords in linear codes are widely used in constructing decoding algorithms and studying linear secret sharing scheme. In this paper, we show that in the binary cyclic code all of the codewords are minimal, except 0 and 1. Then, we obtain a result about the number of minimal codewords in the binary cyclic codes.
منابع مشابه
On the non-minimality of the largest weight codewords in the binary Reed-Muller codes
The study of minimal codewords in linear codes was motivated by Massey who described how minimal codewords of a linear code define access structures for secret sharing schemes. As a consequence of his article, Borissov, Manev, and Nikova initiated the study of minimal codewords in the binary Reed-Muller codes. They counted the number of non-minimal codewords of weight 2d in the binary Reed-Mull...
متن کامل$\prod\limits_{i=1}^{n} \mathbb{Z}_{2^i}$-Additive Cyclic Codes
In this paper we study n ∏ i=1 Z2i -Additive Cyclic Codes. These codes are identified as Z2n [x]submodules of n ∏ i=1 Z2i [x]/〈x αi − 1〉; αi and i being relatively prime for each i = 1, 2, . . . , n. We first define a n ∏ i=1 Z2i -additive cyclic code of a certain length. We then define the distance between two codewords and the minimum distance of such a code. Moreover we relate these to binar...
متن کاملConstructions of binary constant-weight cyclic codes and cyclically permutable codes
A general theorem is proved showing how to ohtain a constant-weight binary cyclic code from a p-ary linear cyclic code, where p is a prime,. by using a representation of Cl;(p) as cyclic shifts of a binary p-tuple. Based on this theorem, constructions are given for four classes of binary constant-weight codes. The first two classes are shown to achieve the Johnson upper bound on minimum distanc...
متن کاملThe structure of single-track Gray codes
Single-track Gray codes are cyclic Gray codes with codewords of length n, such that all the n tracks which correspond to the n distinct coordinates of the codewords are cyclic shifts of the first track. We investigate the structure of such binary codes and show that there is no such code with 2n codewords when n is a power of 2. This implies that the known codes with 2n 2n codewords, when n is ...
متن کاملOn the Non-minimal Codewords in Binary Reed-Muller Codes
First, we compute the number of non-minimal codewords of weight 2dmin in the binary Reed-Muller code RM(r,m). Second, we prove that all codewords of weight greater than 2m − 2m−r+1 in binary RM(r,m), are non-minimal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014